Parallel computation schemes for dynamic relaxation
نویسندگان
چکیده
منابع مشابه
Eecient Interconnection Schemes for Vlsi and Parallel Computation Eecient Interconnection Schemes for Vlsi and Parallel Computation
This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the rst case, the goal is to construct eecient interconnec-tion networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a nal part of this thesis provides lower bounds on...
متن کاملParallel relaxation algorithm for disparity computation
the respective images ( 1 4 p in Fig. 2a and 7 p in Fig. 2b). The unprocessed image in Fig. 2a was obtained at a location on the sample close to that displayed in the deconvolved image. The images were captured by sampling 1024 vertical and 200 horizontal pixels, and were averaged 10 times. Each image was acquired in -5 1 s. In conclusion, we describe a systems theory model which serves as the ...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملSchemes for Parallel Quantum Computation Without Local Control of Qubits
Typical quantum computing schemes require transformations (‘gates’) to be targeted at specific elements (‘qubits’). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally applied transformations. Here we demonstrate the minimum physical requirements for such an approach: a one-dimensional array composed of two alternating ‘types...
متن کاملAlternating Schemes of Parallel Computation for the Diffusion Problems
In this paper, a set of new alternating segment explicit-implicit (NASEI) schemes is derived based on an one-dimensional diffusion problem. The schemes are capable of parallel computation; third-order accurate in space; and stable under a reasonable mesh condition. The numerical examples show that the NASEI schemes are more accurate than either the old ASEI or the ASCN schemes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Computations
سال: 1994
ISSN: 0264-4401
DOI: 10.1108/02644409410799407